K-Medoids Computation Model Framework for Security in Distributed Architecture Networks
نویسندگان
چکیده
منابع مشابه
Resilience-Based Framework for Distributed Generation Planning in Distribution Networks
Events with low probability and high impact, which annually cause high damages, seriously threaten the health of the distribution networks. Hence, more attention to the issue of enhancing network resilience and continuity of power supply, feels more than ever, all over the world. In modern distribution networks, because of the increasing presence of distributed generation resources, an alternat...
متن کاملA Distributed Security Architecture for ad hoc Networks
Secure communication in ad hoc networks is an inherent problem because of the distributiveness of the nodes and the reliance on cooperation between the nodes. All the nodes in such networks rely and trust other nodes for forwarding packets because of their limitation in the range of transmission. Due to the absence of any central administrative node, verification of authenticity of nodes is ver...
متن کاملDSA-Mesh: a distributed security architecture for wireless mesh networks
Wireless mesh networks (WMNs) have emerged recently as a technology for next-generation wireless networking. They consist of mesh routers and clients, where mesh routers are almost static and form the backbone of WMNs. WMNs provide network access for both mesh and conventional clients. In this paper, we propose DSA-Mesh, a fully distributed security architecture that provides access control for...
متن کاملParallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملK-Medoids For K-Means Seeding
We run experiments showing that algorithm clarans (Ng et al., 2005) finds better Kmedoids solutions than the standard algorithm. This finding, along with the similarity between the standard K-medoids and K-means algorithms, suggests that clarans may be an effective K-means initializer. We show that this is the case, with clarans outperforming other popular seeding algorithms on 23/23 datasets w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/ijca2015907315